On local search for the generalized graph coloring problem

Given an edge-weighted graph and an integer k, the generalized graph coloring problem is the problem of partitioning the vertex set into k subsets so as to minimize the total weight of the edges that are included in a single subset. We recall a result on the equivalence between Karush–Kuhn–Tucker points for a quadratic programming formulation and local optima for the simple 5ip-neighborhood. We also show that the quality of local optima with respect to a large class of neighborhoods may be arbitrarily bad and that some local optima may be hard to 6nd. c © 2002 Elsevier Science B.V. All rights reserved.